Designing S-boxes for Ciphers Resistant to Differential Cryptanalysis
نویسندگان
چکیده
This paper examines recent work in the area of bent-function-based substitution boxes in order to refine the relationship between s-box construction and immunity to the differential cryptanalysis attack described by Biham and Shamir. It is concluded that m n × s-boxes, m n < , which are partially bent-function-based are the most appropriate choice for private-key cryptosystems constructed as substitution-permutation networks (SPNs). Since s-boxes of this dimension and with this property have received little attention in the open literature, this paper provides a description of their construction and shows how they can be incorporated in a design procedure for a family of SPN cryptosystems with desirable cryptographic properties.
منابع مشابه
On a Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
We introduce a new methodology for designing block ciphers with provable security against differential and linear cryptanalysis. It is based on three new principles: change of the location of round functions, round functions with recursive structure, and substitution boxes of different sizes. The first realizes parallel computation of the round functions without losing provable security, and th...
متن کاملNew Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
Abst rac t . We introduce a methodology for designing block ciphers with provable security against differential and linear cryptanalysis. It is based on three new principles: change of the location of round functions, round functions with recursive structure, and substitution boxes of different sizes. The first realizes parallel computation of the round functions without losing provable securit...
متن کاملPartition-Based Trapdoor Ciphers
This paper deals with block ciphers embedding a trapdoor which consists in mapping a partition of the plaintext space to a partition of the ciphertext space. In a first part, this issue is reduced to the study of the S-boxes of the cipher satisfying a few criteria. Then, differential and linear properties of such S-boxes are assessed and an algorithm to build optimal S-boxes is provided. Finall...
متن کاملResistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis
Linear cryptanalysis and diierential cryptanalysis are two recently introduced, powerful methodologies for attacking private-key block ciphers. In this paper, we examine the application of these two cryptanalysis techniques to a CAST-like encryption algorithm based on randomly generated s-boxes. It is shown that, when randomly generated substitution boxes (s-boxes) are used in a CAST-like algor...
متن کاملDesign Strategies for ARX with Provable Bounds: Sparx and LAX
We present, for the first time, a general strategy for designing ARX symmetric-key primitives with provable resistance against singletrail differential and linear cryptanalysis. The latter has been a long standing open problem in the area of ARX design. The wide trail design strategy (WTS), that is at the basis of many S-box based ciphers, including the AES, is not suitable for ARX designs due ...
متن کامل